SoK: Verifiability Notions for E-Voting Protocols
Identifieur interne : 000020 ( Main/Exploration ); précédent : 000019; suivant : 000021SoK: Verifiability Notions for E-Voting Protocols
Auteurs : Véronique Cortier [France] ; David Galindo [Royaume-Uni] ; Mueller Johannes [Allemagne] ; Ralf Kuesters [Allemagne] ; Truderung Tomasz [Allemagne]Source :
Abstract
There have been intensive research efforts in the last two decades or so to design and deploy electronic voting (e-voting) protocols and systems which allow voters and/or external auditors to check that the votes were counted correctly. This security property, which not least was motivated by numerous problems in even national elections, is called verifiability. It is meant to defend against voting devices and servers that have programming errors or are outright malicious. In order to properly evaluate and analyze e-voting protocols and systems w.r.t. verifiability, one fundamental challenge has been to formally capture the meaning of this security property. While the first formal definitions of verifiability were devised in the late 1980s already, new verifiability definitions are still being proposed. The definitions differ in various aspects, including the classes of protocols they capture and even their formulations of the very core of the meaning of verifiability. This is an unsatisfying state of affairs, leaving the research on the verifiability of e-voting protocols and systems in a fuzzy state.In this paper, we review all formal definitions of verifiability proposed in the literature and cast them in a framework proposed by Küsters, Truderung, and Vogt (the KTV framework), yielding a uniform treatment of verifiability. This enables us to provide a detailed comparison of the various definitions of verifiability from the literature. We thoroughly discuss advantages and disadvantages, and point to limitations and problems. Finally, from these discussions and based on the KTV framework, we distill a general definition of verifiability, which can be instantiated in various ways, and provide precise guidelines for its instantiation. The concepts for verifiability we develop should be widely applicable also beyond the framework used here. Altogether, our work offers a well-founded reference point for future research on the verifiability of e-voting systems.
Url:
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Hal, to step Corpus: 004607
- to stream Hal, to step Curation: 004607
- to stream Hal, to step Checkpoint: 000020
- to stream Main, to step Merge: 000020
- to stream Main, to step Curation: 000020
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">SoK: Verifiability Notions for E-Voting Protocols</title><author><name sortKey="Cortier, Veronique" sort="Cortier, Veronique" uniqKey="Cortier V" first="Véronique" last="Cortier">Véronique Cortier</name><affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-445522" status="VALID"><idno type="RNSR">201622052E</idno><orgName>Proof techniques for security protocols</orgName><orgName type="acronym">PESTO</orgName><date type="start">2016-01-01</date><desc><address><country key="FR"></country></address><ref type="url">http://www.inria.fr/equipes/pesto</ref></desc><listRelation><relation active="#struct-423084" type="direct"></relation><relation active="#struct-206040" type="indirect"></relation><relation active="#struct-300009" type="indirect"></relation><relation active="#struct-413289" type="indirect"></relation><relation name="UMR7503" active="#struct-441569" type="indirect"></relation><relation active="#struct-129671" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-423084" type="direct"><org type="department" xml:id="struct-423084" status="VALID"><orgName>Department of Formal Methods </orgName><orgName type="acronym">LORIA - FM</orgName><desc><address><country key="FR"></country></address><ref type="url">http://www.loria.fr/la-recherche-en/departements/formal-methods</ref></desc><listRelation><relation active="#struct-206040" type="direct"></relation><relation active="#struct-300009" type="indirect"></relation><relation active="#struct-413289" type="indirect"></relation><relation name="UMR7503" active="#struct-441569" type="indirect"></relation></listRelation></org></tutelle><tutelle active="#struct-206040" type="indirect"><org type="laboratory" xml:id="struct-206040" status="VALID"><idno type="IdRef">067077927</idno><idno type="RNSR">198912571S</idno><idno type="IdUnivLorraine">[UL]RSI--</idno><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName><orgName type="acronym">LORIA</orgName><date type="start">2012-01-01</date><desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.loria.fr</ref></desc><listRelation><relation active="#struct-300009" type="direct"></relation><relation active="#struct-413289" type="direct"></relation><relation name="UMR7503" active="#struct-441569" type="direct"></relation></listRelation></org></tutelle><tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName><orgName type="acronym">Inria</orgName><desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.inria.fr/en/</ref></desc></org></tutelle><tutelle active="#struct-413289" type="indirect"><org type="institution" xml:id="struct-413289" status="VALID"><idno type="IdRef">157040569</idno><idno type="IdUnivLorraine">[UL]100--</idno><orgName>Université de Lorraine</orgName><orgName type="acronym">UL</orgName><date type="start">2012-01-01</date><desc><address><addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.univ-lorraine.fr/</ref></desc></org></tutelle><tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno><idno type="IdRef">02636817X</idno><orgName>Centre National de la Recherche Scientifique</orgName><orgName type="acronym">CNRS</orgName><date type="start">1939-10-19</date><desc><address><country key="FR"></country></address><ref type="url">http://www.cnrs.fr/</ref></desc></org></tutelle><tutelle active="#struct-129671" type="direct"><org type="laboratory" xml:id="struct-129671" status="VALID"><idno type="RNSR">198618246Y</idno><orgName>INRIA Nancy - Grand Est</orgName><desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine><country key="FR"></country></address><ref type="url">http://www.inria.fr/nancy</ref></desc><listRelation><relation active="#struct-300009" type="direct"></relation></listRelation></org></tutelle></tutelles></hal:affiliation><country>France</country><placeName><settlement type="city">Nancy</settlement><settlement type="city">Metz</settlement><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region></placeName><orgName type="university">Université de Lorraine</orgName></affiliation></author><author><name sortKey="Galindo, David" sort="Galindo, David" uniqKey="Galindo D" first="David" last="Galindo">David Galindo</name><affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-30659" status="INCOMING"><orgName>Université de Birmingham</orgName><orgName type="acronym">UNIVERSITé DE BIRMINGHAM</orgName><desc><address><addrLine>Department of Metallurgy and Materials, University of Birmingham, Edgbaston Birmingham B15 2TT, UK</addrLine><country key="GB"></country></address></desc><listRelation><relation active="#struct-308958" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-308958" type="direct"><org type="institution" xml:id="struct-308958" status="INCOMING"><orgName>Université de Birmingham</orgName><desc><address><country key="FR"></country></address></desc></org></tutelle></tutelles></hal:affiliation><country>Royaume-Uni</country></affiliation></author><author><name sortKey="Johannes, Mueller" sort="Johannes, Mueller" uniqKey="Johannes M" first="Mueller" last="Johannes">Mueller Johannes</name><affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-87731" status="VALID"><orgName>Universität Trier</orgName><desc><address><addrLine>FB 4, Abteilung Informatik, 54286 Trier</addrLine><country key="DE"></country></address></desc><listRelation><relation active="#struct-366176" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-366176" type="direct"><org type="institution" xml:id="struct-366176" status="INCOMING"><orgName>Universität Trier</orgName><desc><address><country key="FR"></country></address></desc></org></tutelle></tutelles></hal:affiliation><country>Allemagne</country></affiliation></author><author><name sortKey="Kuesters, Ralf" sort="Kuesters, Ralf" uniqKey="Kuesters R" first="Ralf" last="Kuesters">Ralf Kuesters</name><affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-87731" status="VALID"><orgName>Universität Trier</orgName><desc><address><addrLine>FB 4, Abteilung Informatik, 54286 Trier</addrLine><country key="DE"></country></address></desc><listRelation><relation active="#struct-366176" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-366176" type="direct"><org type="institution" xml:id="struct-366176" status="INCOMING"><orgName>Universität Trier</orgName><desc><address><country key="FR"></country></address></desc></org></tutelle></tutelles></hal:affiliation><country>Allemagne</country></affiliation></author><author><name sortKey="Tomasz, Truderung" sort="Tomasz, Truderung" uniqKey="Tomasz T" first="Truderung" last="Tomasz">Truderung Tomasz</name><affiliation wicri:level="1"><hal:affiliation type="institution" xml:id="struct-451837" status="INCOMING"><orgName>POLYAS</orgName><desc><address><country key="DE"></country></address></desc></hal:affiliation><country>Allemagne</country></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">HAL</idno><idno type="RBID">Hal:hal-01280445</idno><idno type="halId">hal-01280445</idno><idno type="halUri">https://hal.inria.fr/hal-01280445</idno><idno type="url">https://hal.inria.fr/hal-01280445</idno><date when="2016-05-23">2016-05-23</date><idno type="wicri:Area/Hal/Corpus">004607</idno><idno type="wicri:Area/Hal/Curation">004607</idno><idno type="wicri:Area/Hal/Checkpoint">000020</idno><idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">000020</idno><idno type="wicri:Area/Main/Merge">000020</idno><idno type="wicri:Area/Main/Curation">000020</idno><idno type="wicri:Area/Main/Exploration">000020</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">SoK: Verifiability Notions for E-Voting Protocols</title><author><name sortKey="Cortier, Veronique" sort="Cortier, Veronique" uniqKey="Cortier V" first="Véronique" last="Cortier">Véronique Cortier</name><affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-445522" status="VALID"><idno type="RNSR">201622052E</idno><orgName>Proof techniques for security protocols</orgName><orgName type="acronym">PESTO</orgName><date type="start">2016-01-01</date><desc><address><country key="FR"></country></address><ref type="url">http://www.inria.fr/equipes/pesto</ref></desc><listRelation><relation active="#struct-423084" type="direct"></relation><relation active="#struct-206040" type="indirect"></relation><relation active="#struct-300009" type="indirect"></relation><relation active="#struct-413289" type="indirect"></relation><relation name="UMR7503" active="#struct-441569" type="indirect"></relation><relation active="#struct-129671" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-423084" type="direct"><org type="department" xml:id="struct-423084" status="VALID"><orgName>Department of Formal Methods </orgName><orgName type="acronym">LORIA - FM</orgName><desc><address><country key="FR"></country></address><ref type="url">http://www.loria.fr/la-recherche-en/departements/formal-methods</ref></desc><listRelation><relation active="#struct-206040" type="direct"></relation><relation active="#struct-300009" type="indirect"></relation><relation active="#struct-413289" type="indirect"></relation><relation name="UMR7503" active="#struct-441569" type="indirect"></relation></listRelation></org></tutelle><tutelle active="#struct-206040" type="indirect"><org type="laboratory" xml:id="struct-206040" status="VALID"><idno type="IdRef">067077927</idno><idno type="RNSR">198912571S</idno><idno type="IdUnivLorraine">[UL]RSI--</idno><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName><orgName type="acronym">LORIA</orgName><date type="start">2012-01-01</date><desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.loria.fr</ref></desc><listRelation><relation active="#struct-300009" type="direct"></relation><relation active="#struct-413289" type="direct"></relation><relation name="UMR7503" active="#struct-441569" type="direct"></relation></listRelation></org></tutelle><tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName><orgName type="acronym">Inria</orgName><desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.inria.fr/en/</ref></desc></org></tutelle><tutelle active="#struct-413289" type="indirect"><org type="institution" xml:id="struct-413289" status="VALID"><idno type="IdRef">157040569</idno><idno type="IdUnivLorraine">[UL]100--</idno><orgName>Université de Lorraine</orgName><orgName type="acronym">UL</orgName><date type="start">2012-01-01</date><desc><address><addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.univ-lorraine.fr/</ref></desc></org></tutelle><tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno><idno type="IdRef">02636817X</idno><orgName>Centre National de la Recherche Scientifique</orgName><orgName type="acronym">CNRS</orgName><date type="start">1939-10-19</date><desc><address><country key="FR"></country></address><ref type="url">http://www.cnrs.fr/</ref></desc></org></tutelle><tutelle active="#struct-129671" type="direct"><org type="laboratory" xml:id="struct-129671" status="VALID"><idno type="RNSR">198618246Y</idno><orgName>INRIA Nancy - Grand Est</orgName><desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine><country key="FR"></country></address><ref type="url">http://www.inria.fr/nancy</ref></desc><listRelation><relation active="#struct-300009" type="direct"></relation></listRelation></org></tutelle></tutelles></hal:affiliation><country>France</country><placeName><settlement type="city">Nancy</settlement><settlement type="city">Metz</settlement><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region></placeName><orgName type="university">Université de Lorraine</orgName></affiliation></author><author><name sortKey="Galindo, David" sort="Galindo, David" uniqKey="Galindo D" first="David" last="Galindo">David Galindo</name><affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-30659" status="INCOMING"><orgName>Université de Birmingham</orgName><orgName type="acronym">UNIVERSITé DE BIRMINGHAM</orgName><desc><address><addrLine>Department of Metallurgy and Materials, University of Birmingham, Edgbaston Birmingham B15 2TT, UK</addrLine><country key="GB"></country></address></desc><listRelation><relation active="#struct-308958" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-308958" type="direct"><org type="institution" xml:id="struct-308958" status="INCOMING"><orgName>Université de Birmingham</orgName><desc><address><country key="FR"></country></address></desc></org></tutelle></tutelles></hal:affiliation><country>Royaume-Uni</country></affiliation></author><author><name sortKey="Johannes, Mueller" sort="Johannes, Mueller" uniqKey="Johannes M" first="Mueller" last="Johannes">Mueller Johannes</name><affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-87731" status="VALID"><orgName>Universität Trier</orgName><desc><address><addrLine>FB 4, Abteilung Informatik, 54286 Trier</addrLine><country key="DE"></country></address></desc><listRelation><relation active="#struct-366176" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-366176" type="direct"><org type="institution" xml:id="struct-366176" status="INCOMING"><orgName>Universität Trier</orgName><desc><address><country key="FR"></country></address></desc></org></tutelle></tutelles></hal:affiliation><country>Allemagne</country></affiliation></author><author><name sortKey="Kuesters, Ralf" sort="Kuesters, Ralf" uniqKey="Kuesters R" first="Ralf" last="Kuesters">Ralf Kuesters</name><affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-87731" status="VALID"><orgName>Universität Trier</orgName><desc><address><addrLine>FB 4, Abteilung Informatik, 54286 Trier</addrLine><country key="DE"></country></address></desc><listRelation><relation active="#struct-366176" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-366176" type="direct"><org type="institution" xml:id="struct-366176" status="INCOMING"><orgName>Universität Trier</orgName><desc><address><country key="FR"></country></address></desc></org></tutelle></tutelles></hal:affiliation><country>Allemagne</country></affiliation></author><author><name sortKey="Tomasz, Truderung" sort="Tomasz, Truderung" uniqKey="Tomasz T" first="Truderung" last="Tomasz">Truderung Tomasz</name><affiliation wicri:level="1"><hal:affiliation type="institution" xml:id="struct-451837" status="INCOMING"><orgName>POLYAS</orgName><desc><address><country key="DE"></country></address></desc></hal:affiliation><country>Allemagne</country></affiliation></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">There have been intensive research efforts in the last two decades or so to design and deploy electronic voting (e-voting) protocols and systems which allow voters and/or external auditors to check that the votes were counted correctly. This security property, which not least was motivated by numerous problems in even national elections, is called verifiability. It is meant to defend against voting devices and servers that have programming errors or are outright malicious. In order to properly evaluate and analyze e-voting protocols and systems w.r.t. verifiability, one fundamental challenge has been to formally capture the meaning of this security property. While the first formal definitions of verifiability were devised in the late 1980s already, new verifiability definitions are still being proposed. The definitions differ in various aspects, including the classes of protocols they capture and even their formulations of the very core of the meaning of verifiability. This is an unsatisfying state of affairs, leaving the research on the verifiability of e-voting protocols and systems in a fuzzy state.In this paper, we review all formal definitions of verifiability proposed in the literature and cast them in a framework proposed by Küsters, Truderung, and Vogt (the KTV framework), yielding a uniform treatment of verifiability. This enables us to provide a detailed comparison of the various definitions of verifiability from the literature. We thoroughly discuss advantages and disadvantages, and point to limitations and problems. Finally, from these discussions and based on the KTV framework, we distill a general definition of verifiability, which can be instantiated in various ways, and provide precise guidelines for its instantiation. The concepts for verifiability we develop should be widely applicable also beyond the framework used here. Altogether, our work offers a well-founded reference point for future research on the verifiability of e-voting systems.</div></front></TEI><affiliations><list><country><li>Allemagne</li><li>France</li><li>Royaume-Uni</li></country><region><li>Grand Est</li><li>Lorraine (région)</li></region><settlement><li>Metz</li><li>Nancy</li></settlement><orgName><li>Université de Lorraine</li></orgName></list><tree><country name="France"><region name="Grand Est"><name sortKey="Cortier, Veronique" sort="Cortier, Veronique" uniqKey="Cortier V" first="Véronique" last="Cortier">Véronique Cortier</name></region></country><country name="Royaume-Uni"><noRegion><name sortKey="Galindo, David" sort="Galindo, David" uniqKey="Galindo D" first="David" last="Galindo">David Galindo</name></noRegion></country><country name="Allemagne"><noRegion><name sortKey="Johannes, Mueller" sort="Johannes, Mueller" uniqKey="Johannes M" first="Mueller" last="Johannes">Mueller Johannes</name></noRegion><name sortKey="Kuesters, Ralf" sort="Kuesters, Ralf" uniqKey="Kuesters R" first="Ralf" last="Kuesters">Ralf Kuesters</name><name sortKey="Tomasz, Truderung" sort="Tomasz, Truderung" uniqKey="Tomasz T" first="Truderung" last="Tomasz">Truderung Tomasz</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000020 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000020 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= Hal:hal-01280445
|texte= SoK: Verifiability Notions for E-Voting Protocols
}}
| This area was generated with Dilib version V0.6.33. |  |